Search Direction ∗
نویسندگان
چکیده
A tractable model of pricing under directed search is proposed and integrated with a position auction for better slots (which rationalizes the consumer search order). Search is always inefficiently low because firms price out further exploration. Equilibrium product prices are such that the marginal consumer’s surplus decreases in the order of search. Consumers always find it optimal to follow the order of search that results from whatever allocation rule used to determine firms’ positions. optimal rankings that achieve the maximization of joint profit, social welfare or consumer surplus are characterized by means of firm specific scores. In a generalized second price auction, any equilibrium that satisfies a “no-envy” condition always implements the joint profit maximizing order and such an equilibrium is shown to exist for a wide range of parameters characterizing product heterogeneity.
منابع مشابه
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
Abstract. We present a line search multigrid method for solving discretized versions of general unconstrained infinite dimensional optimization problems. At each iteration on each level, the algorithm computes either a “direct search” direction on the current level or a “recursive search” direction from coarser level models. Introducing a new condition that must be satisfied by a backtracking l...
متن کاملPriming of luminance-defined motion direction in visual search.
Features that we have recently attended to strongly influence how we allocate visual attention across a subsequently viewed visual scene. Here, we investigate the characteristics of any such repetition effects during visual search for Gabor patch targets drifting in the odd direction relative to a set of distractors. The results indicate that repetition of motion direction has a strong effect u...
متن کاملA Feasible Directions Method for Nonsmooth Convex Optimization
We propose a new technique for minimization of convex functions not necessarily smooth. Our approach employs an equivalent constrained optimization problem and approximated linear programs obtained with cutting planes. At each iteration a search direction and a step length are computed. If the step length is considered “non serious”, a cutting plane is added and a new search direction is comput...
متن کاملAn algorithm for projecting a reference direction onto the nondominated set of given points
In this paper, we consider the problem of searching nondominated alternatives in a discrete multiple criteria problem. The search procedure is based on the use of a reference direction. A reference direction reflects the desire of the decision maker (DM) to specify a search direction. To find a set of given alternatives related somehow to the reference direction specified by the DM, the referen...
متن کاملVariationally localized search direction method for constrained optimization of non-orthogonal, localized orbitals in electronic structure calculations.
A new method for the constrained optimization of non-orthogonal, spatially localized orbitals using direct energy minimization techniques, in the context of electronic structure calculations, is presented. The variationally localized search direction (VLSD) method, as it was named, ensures that strict localization constraints are imposed upon the search direction vectors exactly, analytically a...
متن کاملUncertainty quantification of reservoir performance predictions using a stochastic optimization algorithm
The simultaneous perturbation stochastic approximation (SPSA) algorithm is modified to obtain a stochastic Gaussian search direction (SGSD) algorithm for automatic history matching. The search direction in the SGSD algorithm is obtained by simultaneously perturbing the reservoir model with unconditional realizations from a Gaussian distribution. This search direction has two nice properties: (1...
متن کامل